Geometric Hashing: A General And Efficient Model-based Recognition Scheme
نویسندگان
چکیده
منابع مشابه
A New Object Detection Technique Based on Geometric Hashing
This paper describes the modifications of Geometric Hashing pattern recognition scheme to fulfill the requirements of real-time industrial applications in recognizing general shapes with large numbers of feature points. The scheme is robust to variety of object transformations and partial occlusion. By decomposing the pattern into sub-patterns, using a plurality of hash tables to record the sub...
متن کاملGeometric Hashing: Rehashing for Bayesian Voting
Geometric hashing is a model-based recognition technique based on matching of transformation-invariant object representations stored in a hash table. Today it is widely used as an object recognition method in numerous applications. In the last decade a number of enhancements have been suggested to the basic method improving its performance and reliability. Here we consider two of them. One is r...
متن کاملUsing Pattern Recognition for Self-Localization in Semiconductor Manufacturing Systems
In this paper we present a new method for self-localization on wafers using geometric hashing. The proposed technique is robust to image changes induced by process variations, as opposed to the traditional, correlation based methods. Moreover, it eliminates the need in training on reference patterns. Two enhancements are introduced to the basic geometric hashing scheme improving its performance...
متن کاملA Probabilistic Approach to Geometric Hashing Using Line Features
One of the most important goals of computer vision research is object recognition. Most current object recognition algorithms assume reliable image segmentation, which in practice is often not available. This research exploits the combination of the Hough method with the geometric hashing technique for model-based object recognition in seriously degraded intensity images. We describe the analys...
متن کاملGeometric hashing: error analysis
We develop a model for predicting the probability of incorrect, random matches when using a geometric hashing based recognition scheme. To estimate the vote for random matches we approximate the voting function by a discrete function and use the binomial distribution. The resulting probability distribution of votes for random matches is compared with experiments that have a set of artificially ...
متن کامل